A new proximity function generating the best known iteration bounds for both large-update and small-update interior-point methods
نویسندگان
چکیده
منابع مشابه
Large-update interior point algorithm for LCP
In this paper we propose a new large-update primal-dual interior point algorithm for P∗(κ) linear complementarity problems (LCPs). We generalize the analysis of BER’s primal-dual interior point algorithm for LP to P∗(κ) LCPs. New search directions and proximity measures are proposed based on a new kernel function which has linear growth term. We showed that if a strictly feasible starting point...
متن کاملInterior Point Methods for Sufficient Horizontal LCP in a Wide Neighborhood of the Central Path with Best Known Iteration Complexity
Three interior point methods are proposed for sufficient horizontal linear complementarity problems (HLCP): a large update path following algorithm, a first order corrector-predictor method, and a second order corrector-predictor method. All algorithms produce sequences of iterates in the wide neighborhood of the central path introduced by Ai and Zhang. The algorithms do not depend on the handi...
متن کاملAn interior-point algorithm for $P_{ast}(kappa)$-linear complementarity problem based on a new trigonometric kernel function
In this paper, an interior-point algorithm for $P_{ast}(kappa)$-Linear Complementarity Problem (LCP) based on a new parametric trigonometric kernel function is proposed. By applying strictly feasible starting point condition and using some simple analysis tools, we prove that our algorithm has $O((1+2kappa)sqrt{n} log nlogfrac{n}{epsilon})$ iteration bound for large-update methods, which coinc...
متن کاملA new large - update interior point algorithm for P ∗ ( ) linear complementarity problems
In this paper we propose a new large-update primal-dual interior point algorithm for P∗( ) linear complementarity problems (LCPs). We generalize Bai et al.’s [A primal-dual interior-point method for linear optimization based on a new proximity function, Optim. Methods Software 17(2002) 985–1008] primal-dual interior point algorithm for linear optimization (LO) problem to P∗( ) LCPs. New search ...
متن کاملA Class of New Large-Update Primal-Dual Interior-Point Algorithms for Linear Complementarity Problems
In this paper we propose a class of new large-update primal-dual interior-point algorithms for P∗(κ) nonlinear complementarity problem (NCP), which are based on a class of kernel functions investigated by Bai et al. in their recent work for linear optimization (LO). The arguments for the algorithms are followed as Peng et al.’s for P∗(κ) complementarity problem based on the self-regular functio...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: The ANZIAM Journal
سال: 2007
ISSN: 1446-1811,1446-8735
DOI: 10.1017/s1446181100012827